Random matching in adaptive dynamics

نویسندگان

  • Glenn Ellison
  • Drew Fudenberg
  • Lorens A. Imhof
چکیده

This paper studies the effect of randomness in per-period matching on the long-run outcome of non-equilibrium adaptive processes. If there are many matchings between each strategy revision, the randomness due to matching will be small; our question is when a very small noise due to matching has a negligible effect. We study two different senses of this idea, and provide sufficient conditions for each. The less demanding sense corresponds to sending the matching noise to zero while holding fixed all other aspects of the adaptive process. The second sense in which matching noise can be negligible is that it doesn’t alter the limit distribution obtained as the limit of the invariant distributions as an exogeneous “mutation rate” goes to zero. When applied to a model with mutations, the difference between these two senses is in the order of limits: the first sense asks for continuity of e.g. the ergodic distribution in the matching noise holding the mutation rate fixed, whereas the second sense asks for continuity of the limit distribution in the matching noise.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Efficient Adaptive Boundary Matching Algorithm for Video Error Concealment

Sending compressed video data in error-prone environments (like the Internet and wireless networks) might cause data degradation. Error concealment techniques try to conceal the received data in the decoder side. In this paper, an adaptive boundary matching algorithm is presented for recovering the damaged motion vectors (MVs). This algorithm uses an outer boundary matching or directional tempo...

متن کامل

Adaptive Approximate Record Matching

Typographical data entry errors and incomplete documents, produce imperfect records in real world databases. These errors generate distinct records which belong to the same entity. The aim of Approximate Record Matching is to find multiple records which belong to an entity. In this paper, an algorithm for Approximate Record Matching is proposed that can be adapted automatically with input error...

متن کامل

Extending the Radar Dynamic Range using Adaptive Pulse Compression

The matched filter in the radar receiver is only adapted to the transmitted signal version and its output will be wasted due to non-matching with the received signal from the environment. The sidelobes amplitude of the matched filter output in pulse compression radars are dependent on the transmitted coded waveforms that extended as much as the length of the code on both sides of the target loc...

متن کامل

Toward a mechanics of adaptive behavior: evolutionary dynamics and matching theory statics.

One theory of behavior dynamics instantiates the idea that behavior evolves in response to selection pressure from the environment in the form of reinforcement. This computational theory implements Darwinian principles of selection, reproduction, and mutation, which operate on a population of potential behaviors by means of a genetic algorithm. The behavior of virtual organisms animated by this...

متن کامل

Optimal adaptive leader-follower consensus of linear multi-agent systems: Known and unknown dynamics

In this paper, the optimal adaptive leader-follower consensus of linear continuous time multi-agent systems is considered. The error dynamics of each player depends on its neighbors’ information. Detailed analysis of online optimal leader-follower consensus under known and unknown dynamics is presented. The introduced reinforcement learning-based algorithms learn online the approximate solution...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Games and Economic Behavior

دوره 66  شماره 

صفحات  -

تاریخ انتشار 2009